TAL Recognition in O(M(n)) Time1
نویسندگان
چکیده
We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k × k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but also algorithms designers. The first polynomial time algorithm for TAL parsing was proposed in 1986 and had a run time of O(n6). Quite recently, an O(n3 M(n)) algorithm has been proposed. The algorithm presented in this paper improves the run time of the recent result using an entirely different approach.
منابع مشابه
Presented in the 33rd Annual Meeting of the Association for Computational Linguistics TAL Recognition in O(M(n2)) Time
We propose an O(M(n)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k × k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but a...
متن کاملTAL Recognition in O(M(n2)) Time
We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k x k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but ...
متن کاملSplitting a Delaunay Triangulation in Linear Time1
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.
متن کاملMaintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time1
We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log2 n) expected time where n is the length of the seque...
متن کاملMaterial for “ Visual Recognition by Counting Instances : A Multi - Instance Cardinality Potential Kernel ”
Assume the evaluation of the primitive kernel kx takes O(d) time, where d is the size of the instance feature vectors. Consequently, kx(·, ·) between all instance pairs of two bags Xp and Xq can be computed in O(mpmqd) time. As we explained in Sec. 3.2, the time complexity of computing the marginal probabilities P (yi|Y,X) is O ( m logm ) . Thus, the kernel in (1) can be evaluated in O(mpmqd+mp...
متن کامل